An SVD-like matrix decomposition and its applications
نویسندگان
چکیده
منابع مشابه
An SVD-Like Matrix Decomposition and Its Applications
A matrix S ∈ C2m×2m is symplectic if SJS∗ = J , where J = [ 0 −Im Im 0 ] . Symplectic matrices play an important role in the analysis and numerical solution of matrix problems involving the indefinite inner product x∗(iJ)y. In this paper we provide several matrix factorizations related to symplectic matrices. We introduce a singular value-like decomposition B = QDS−1 for any real matrix B ∈ Rn×...
متن کاملA matrix decomposition and its applications
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملA Numerical Method for Computing an SVD-like Decomposition
We present a numerical method to compute the SVD-like decomposition B = QDS−1, where Q is orthogonal, S is symplectic and D is a permuted diagonal matrix. The method can be applied directly to compute the canonical form of the Hamiltonian matrices of the form JBTB, where J = [ 0 −I I 0 ] . It can also be applied to solve the related application problems such as the gyroscopic systems and linear...
متن کاملApplications of singular-value decomposition (SVD)
Let A be an m × n matrix with m ≥ n. Then one form of the singular-value decomposition of A is A = UΣV, where U and V are orthogonal and Σ is square diagonal. That is, UUT = Irank(A), V V T = Irank(A), U is rank(A)×m, V is rank(A)× n and Σ = σ1 0 · · · 0 0 0 σ2 · · · 0 0 .. .. . . . .. .. 0 0 · · · σrank(A)−1 0 0 0 · · · 0 σrank(A) is a rank(A)× rank(A) diagonal matrix. In add...
متن کاملFace Recognition Using Matrix Decomposition Technique Eigenvectors and SVD
Principle Component Analysis (PCA) is an important and well-known technique of face recognition, where eigenvectors are used. In this paper, we propose a face recognition technique, which combines Eigenvectors with Singular Value Decomposition (SVD) techniques to reduce size of the Eigen-matrix. The detailed theoretical derivation and analysis are presented and a simulation results on Olivetti ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2003
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(03)00370-7